Automorphism groups of generalized Reed-Solomon codes
نویسندگان
چکیده
We look at AG codes associated to P, re-examining the problem of determining their automorphism groups (originally investigated by Dür in 1987 using combinatorial techniques) using recent methods from algebraic geometry. We classify those finite groups that can arise as the automorphism group of an AG code and give an explicit description of how these groups appear. We give examples of generalized Reed-Solomon codes with large automorphism groups G, such as G = PSL(2, q), and explicitly describe their G-module structure.
منابع مشابه
A general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملAutomorphism groups of GRS codes
We look at AG codes associated to P1, re-examining the problem of determining their automorphism groups (originally investigated by Dür in 1987 using combinatorial techniques) using recent methods from algebraic geometry. We classify those finite groups that can arise as the automorphism group of an AG code and give an explicit description of how these groups appear. We give examples of general...
متن کاملThe automorphism group of Generalized Reed-Muller codes
Berger, T. and P. Charpin, The automorphism group of Generalized Reed-Muller codes, Discrete Mathematics 117 (1993) l-17. We prove that the automorphism group of Generalized Reed-Muller codes is the general linear nonhomogeneous group. The Generalized Reed-Muller codes are introduced by Kasami, Lin and Peterson. An extensive study was made by Delsarte, Goethals and Mac-Williams; our result foll...
متن کاملLinear codes using skew polynomials with automorphisms and derivations
In this work the definition of codes as modules over skew polynomial rings of automorphism type is generalized to skew polynomial rings, whose multiplication is defined using an automorphism and a derivation. This produces a more general class of codes which, in some cases, produce better distance bounds than module skew codes constructed only with an automorphism. Extending the approach of Gab...
متن کاملNew Deep Holes of Generalized Reed-Solomon Codes
Deep holes play an important role in the decoding of generalized Reed-Solomon codes. Recently, Wu and Hong [11] found a new class of deep holes for standard Reed-Solomon codes. In the present paper, we give a concise method to obtain a new class of deep holes for generalized Reed-Solomon codes. In particular, for standard Reed-Solomon codes, we get the new class of deep holes given in [11]. Li ...
متن کامل